Cyclotomic Quantum Clock

نویسنده

  • HARET C. ROSU
چکیده

Time can be defined in many different ways depending on context and discipline.1 In quantum physics its operatorial features that are required by the quantum formalism are a matter of ongoing debate. Indeed, time appears to be merely a parameter (c-number) but of course dynamical variables of specific quantum systems (clocks) may be used as substitutes of time. In 1933, Pauli gave a famous argument on the impossibility of introducing a universal time operator Tu obeying the canonical commutation relation [Tu, H ] = ih̄ for any Hamiltonian. According to Pauli, 3

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Harmonic Sums and Polylogarithms Generated by Cyclotomic Polynomials

The computation of Feynman integrals in massive higher order perturbative calculations in renormalizable Quantum Field Theories requires extensions of multiply nested harmonic sums, which can be generated as real representations by Mellin transforms of Poincaré– iterated integrals including denominators of higher cyclotomic polynomials. We derive the cyclotomic harmonic polylogarithms and harmo...

متن کامل

Two Novel D-Flip Flops with Level Triggered Reset in Quantum Dot Cellular Automata Technology

Quantum dot cellular automata (QCA) introduces a pioneer technology in nano scale computer architectures. Employing this technology is one of the solutions to decrease the size of circuits and reducing power dissipation. In this paper, two new optimized FlipFlops with reset input are proposed in quantum dot cellular automata technology. In addition, comparison with related works is performed.Th...

متن کامل

ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T Quantum Mechanics

The ZX-Calculus is a powerful graphical language for quantum mechanics and quantum information processing. The completeness of the language – i.e. the ability to derive any true equation – is a crucial question. In the quest of a complete ZX-calculus, supplementarity has been recently proved to be necessary for quantum diagram reasoning (MFCS 2016). Roughly speaking, supplementarity consists in...

متن کامل

Provably Secure NTRUEncrypt over More General Cyclotomic Rings

NTRUEncrypt is a fast and standardized lattice-based public key encryption scheme, but it lacks a solid security guarantee. In 2011, Stehlé and Steinfeld first proposed a provably secure variant of NTRUEncrypt, denoted by pNE, over power-of-2 cyclotomic rings. The IND-CPA security of pNE is based on the worst-case quantum hardness of classical problems over ideal lattices. Recently, Yu, Xu and ...

متن کامل

Nilpotency in type A cyclotomic quotients

We prove a conjecture made by Brundan and Kleshchev on the nilpotency degree of cyclotomic quotients of rings that categorify one-half of quantum sl(k).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003